TSTP Solution File: CSR138^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR138^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:34:37 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 30 ( 15 unt; 9 typ; 0 def)
% Number of atoms : 33 ( 2 equ; 0 cnn)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 174 ( 36 ~; 31 |; 9 &; 96 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 9 con; 0-2 aty)
% Number of variables : 54 ( 4 ^ 36 !; 14 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
lAnna_THFTYPE_i: $i ).
thf(decl_24,type,
lBill_THFTYPE_i: $i ).
thf(decl_27,type,
lSue_THFTYPE_i: $i ).
thf(decl_28,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_29,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_30,type,
esk1_0: $i ).
thf(decl_31,type,
esk2_0: $i ).
thf(decl_32,type,
esk3_0: $i ).
thf(decl_33,type,
esk4_0: $i ).
thf(con,conjecture,
? [X3: $i > $i > $o,X4: $i > $i > $o,X2: $i] :
( ( X4 @ X2 @ lBill_THFTYPE_i )
& ( X3 @ X2 @ lAnna_THFTYPE_i )
& ( X4
!= ( ^ [X5: $i,X6: $i] : $true ) )
& ( X3
!= ( ^ [X5: $i,X6: $i] : $true ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CyKPFRDRK8/E---3.1_15956.p',con) ).
thf(ax_003,axiom,
? [X1: $i,X2: $i] :
~ ( likes_THFTYPE_IiioI @ X1 @ X2 ),
file('/export/starexec/sandbox2/tmp/tmp.CyKPFRDRK8/E---3.1_15956.p',ax_003) ).
thf(ax,axiom,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/tmp/tmp.CyKPFRDRK8/E---3.1_15956.p',ax) ).
thf(ax_002,axiom,
? [X1: $i,X2: $i] :
~ ( parent_THFTYPE_IiioI @ X1 @ X2 ),
file('/export/starexec/sandbox2/tmp/tmp.CyKPFRDRK8/E---3.1_15956.p',ax_002) ).
thf(ax_007,axiom,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
file('/export/starexec/sandbox2/tmp/tmp.CyKPFRDRK8/E---3.1_15956.p',ax_007) ).
thf(c_0_5,negated_conjecture,
~ ? [X3: $i > $i > $o,X4: $i > $i > $o,X2: $i] :
( ( X4 @ X2 @ lBill_THFTYPE_i )
& ( X3 @ X2 @ lAnna_THFTYPE_i )
& ~ ! [X14: $i,X15: $i] :
( ( X4 @ X14 @ X15 )
<=> $true )
& ~ ! [X16: $i,X17: $i] :
( ( X3 @ X16 @ X17 )
<=> $true ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])])]) ).
thf(c_0_6,negated_conjecture,
! [X18: $i > $i > $o,X19: $i > $i > $o,X20: $i,X21: $i,X22: $i,X23: $i,X24: $i] :
( ( ~ ( X18 @ X23 @ X24 )
| $true
| ~ ( X19 @ X21 @ X22 )
| $true
| ~ ( X19 @ X20 @ lBill_THFTYPE_i )
| ~ ( X18 @ X20 @ lAnna_THFTYPE_i ) )
& ( ~ $true
| ( X18 @ X23 @ X24 )
| ~ ( X19 @ X21 @ X22 )
| $true
| ~ ( X19 @ X20 @ lBill_THFTYPE_i )
| ~ ( X18 @ X20 @ lAnna_THFTYPE_i ) )
& ( ~ ( X18 @ X23 @ X24 )
| $true
| ~ $true
| ( X19 @ X21 @ X22 )
| ~ ( X19 @ X20 @ lBill_THFTYPE_i )
| ~ ( X18 @ X20 @ lAnna_THFTYPE_i ) )
& ( ~ $true
| ( X18 @ X23 @ X24 )
| ~ $true
| ( X19 @ X21 @ X22 )
| ~ ( X19 @ X20 @ lBill_THFTYPE_i )
| ~ ( X18 @ X20 @ lAnna_THFTYPE_i ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X2: $i,X5: $i,X4: $i > $i > $o,X3: $i > $i > $o,X6: $i,X9: $i] :
( ( X3 @ X1 @ X2 )
| ( X4 @ X5 @ X6 )
| ~ $true
| ~ $true
| ~ ( X4 @ X9 @ lBill_THFTYPE_i )
| ~ ( X3 @ X9 @ lAnna_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,plain,
? [X1: $i,X2: $i] :
~ ( likes_THFTYPE_IiioI @ X1 @ X2 ),
inference(fof_simplification,[status(thm)],[ax_003]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X2: $i,X5: $i,X4: $i > $i > $o,X3: $i > $i > $o,X6: $i,X9: $i] :
( ( X4 @ X5 @ X6 )
| ( X3 @ X1 @ X2 )
| ~ ( X4 @ X9 @ lBill_THFTYPE_i )
| ~ ( X3 @ X9 @ lAnna_THFTYPE_i ) ),
inference(cn,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax]) ).
thf(c_0_11,plain,
? [X1: $i,X2: $i] :
~ ( parent_THFTYPE_IiioI @ X1 @ X2 ),
inference(fof_simplification,[status(thm)],[ax_002]) ).
thf(c_0_12,plain,
~ ( likes_THFTYPE_IiioI @ esk3_0 @ esk4_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_8])])]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X2: $i,X6: $i,X5: $i,X3: $i > $i > $o] :
( ( likes_THFTYPE_IiioI @ X1 @ X2 )
| ( X3 @ X5 @ X6 )
| ~ ( X3 @ lSue_THFTYPE_i @ lAnna_THFTYPE_i ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_14,plain,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_007]) ).
thf(c_0_15,plain,
~ ( parent_THFTYPE_IiioI @ esk1_0 @ esk2_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_11])])]) ).
thf(c_0_16,plain,
~ ( likes_THFTYPE_IiioI @ esk3_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X2: $i,X5: $i,X6: $i] :
( ( parent_THFTYPE_IiioI @ X1 @ X2 )
| ( likes_THFTYPE_IiioI @ X5 @ X6 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_18,plain,
~ ( parent_THFTYPE_IiioI @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i,X2: $i] : ( parent_THFTYPE_IiioI @ X1 @ X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_20,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR138^1 : TPTP v8.1.2. Released v4.1.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n014.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 15:08:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.CyKPFRDRK8/E---3.1_15956.p
% 0.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho1 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.49 # Starting new_ho_3 with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.49 # new_ho_3 with pid 16037 completed with status 0
% 0.20/0.49 # Result found by new_ho_3
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho1 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.49 # Starting new_ho_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.20/0.49 # Search class: HGUNF-FFSM00-SSSFFSBN
% 0.20/0.49 # partial match(1): HGUNF-FFSF00-SSSFFSBN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting sh3 with 163s (1) cores
% 0.20/0.49 # sh3 with pid 16041 completed with status 0
% 0.20/0.49 # Result found by sh3
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting post_as_ho1 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.49 # Starting new_ho_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.20/0.49 # Search class: HGUNF-FFSM00-SSSFFSBN
% 0.20/0.49 # partial match(1): HGUNF-FFSF00-SSSFFSBN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting sh3 with 163s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 19
% 0.20/0.49 # Removed by relevancy pruning/SinE : 9
% 0.20/0.49 # Initial clauses : 13
% 0.20/0.49 # Removed in clause preprocessing : 3
% 0.20/0.49 # Initial clauses in saturation : 10
% 0.20/0.49 # Processed clauses : 24
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 24
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 1
% 0.20/0.49 # Backward-rewritten : 5
% 0.20/0.49 # Generated clauses : 16
% 0.20/0.49 # ...of the previous two non-redundant : 13
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 16
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 5
% 0.20/0.49 # ...of those cached : 0
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 8
% 0.20/0.49 # Positive orientable unit clauses : 4
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 3
% 0.20/0.49 # Current number of unprocessed clauses: 9
% 0.20/0.49 # ...number of literals in the above : 26
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 16
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 2
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 2
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 1
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 6
% 0.20/0.49 # BW rewrite match successes : 6
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 986
% 0.20/0.49 # Search garbage collected termcells : 179
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.007 s
% 0.20/0.49 # Maximum resident set size: 1760 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.007 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.010 s
% 0.20/0.49 # Maximum resident set size: 1772 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------